#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 1e5+10;
const int mod = 998244353;

int A[N<<2],B[N<<2],Wn[N<<2],len,rev[N<<2],F[N<<2],G[N<<2],n;

ll qp(ll x,int t){ll res=1;for(;t;t>>=1,x=x*x%mod)if(t&1)res=res*x%mod;return res;}

void init_NTT(int l){
	for(len = 1;len <= 2 * l;len <<= 1);
	for(int i = 1;i < len;i++) rev[i] = rev[i >> 1] >> 1 | (i & 1 ? len >> 1 : 0);
}

void NTT(int *f,int on = 1){
	for(int i = 1;i < len;i++) if(i < rev[i]) swap(f[i],f[rev[i]]);
	for(int h = 2;h <= len;h <<= 1){
		int wn = Wn[h];
		for(int i = 0;i < len;i += h){
			ll ww = 1;
			for(int k = i;k < i + h / 2;k++){
				int u = f[k],v = f[k + h/2] * ww % mod; ww = ww * wn % mod;
				f[k] = (u + v) % mod,f[k + h/2] = (u - v + mod) % mod;
			}
		}
	}if(on == -1) {reverse(f+1,f+len);int inv = qp(len,mod-2);for(int i = 0;i < len;i++) f[i] = 1ll * f[i] * inv % mod;}
}

void solve(int l,int r){
	if(l == r) return F[l] = (l ? F[l] * qp(l,mod-2) % mod : 1),void();
	int mid = l + r >> 1; solve(l,mid); init_NTT(r - l + 1);
	for(int i = l;i <= mid;i++) A[i-l] = F[i];  for(int i = mid + 1 - l;i < len;i++) A[i] = 0;
	for(int i = 0;i <= r - l + 1;i++) B[i] = G[i];  for(int i = r - l + 2;i < len;i++) B[i] = 0;
	NTT(A); NTT(B); for(int i = 0;i < len;i++) A[i] = 1ll * A[i] * B[i] % mod; NTT(A,-1);
	for(int i = mid+1;i <= r;i++) F[i] = (F[i] + A[i - l - 1]) % mod;
	solve(mid+1,r);
}

signed main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in; for(int i = 0;i < n;i++) G[i] = in;
	for(int i = 1;i < n;i++) G[i-1] = 1ll * G[i] * i % mod; G[n-1] = 0;
	for(int h = 1;h < N << 2;h <<= 1) Wn[h] = qp(3,(mod-1)/h);
	solve(0,n-1);
	for(int i = 0;i < n;i++) printf("%d%c",F[i]," \n"[i==n-1]);
	return 0;
}
